Graph Theory By Lars
نویسنده
چکیده
This development provides a formalization of directed graphs, supporting (labelled) multi-edges and infinite graphs. A polymorphic edge type allows edges to be treated as pairs of vertices, if multi-edges are not required. Formalized properties are i.a. walks (and related concepts), connectedness and subgraphs and basic properties of isomorphisms. This formalization is used to prove characterizations of Euler Trails, Shortest Paths and Kuratowski subgraphs. Definitions and nomenclature are based on [1].
منابع مشابه
Graph Theory By Lars Noschinski
This development provides a formalization of directed graphs, supporting (labelled) multi-edges and infinite graphs. A polymorphic edge type allows edges to be treated as pairs of vertices, if multi-edges are not required. Formalized properties are i.a. walks (and related concepts), connectedness and subgraphs and basic properties of isomorphisms. This formalization is used to prove characteriz...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملComputing Word Senses by Semantic Mirroring and Spectral Graph Partitioning
Using the technique of ”semantic mirroring” a graph is obtained that represents words and their translations from a parallel corpus or a bilingual lexicon. The connectedness of the graph holds information about the different meanings of words that occur in the translations. Spectral graph theory is used to partition the graph, which leads to a grouping of the words according to different senses...
متن کاملComputing Semantic Clusters by Semantic Mirroring and Spectral Graph Partitioning
Using the technique of semantic mirroring a graph is obtained that represents words and their translations from a parallel corpus or a bilingual lexicon. The connectedness of the graph holds information about the semantic relations of words that occur in the translations. Spectral graph theory is used to partition the graph, which leads to a grouping of the words in different clusters. We illus...
متن کاملSome Fixed Point Results on Intuitionistic Fuzzy Metric Spaces with a Graph
In 2006, Espinola and Kirk made a useful contribution on combining fixed point theoryand graph theory. Recently, Reich and Zaslavski studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In this paper, by using the main idea of their work and the idea of combining fixed point theory on intuitionistic fuzzy metric spaces and graph theory, ...
متن کامل